Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares
نویسندگان
چکیده
It is proved in this paper that every bipartite graphic sequence with the minimum degree δ ≥ 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture originally proposed by Keedwell (1993) and reproposed by Cameron (1999) about simultaneous edgecolorings and critical partial Latin squares. ∗Mathematics Subject Classification (2000): 05C15, 05B15, 05C38, 05C70, 05C07.
منابع مشابه
Inside-Out Polytopes
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart’s theory of lattice-point counting to a convex pol...
متن کاملNowhere-Zero 3-Flows in Squares of Graphs
It was conjectured by Tutte that every 4-edge-connected graph admits a nowherezero 3-flow. In this paper, we give a complete characterization of graphs whose squares admit nowhere-zero 3-flows and thus confirm Tutte’s 3-flow conjecture for the family of squares of graphs.
متن کاملGroup Connectivity and Group Colorings of Graphs — A Survey
In 1950s, Tutte introduced the theory of nowhere-zero flows as a tool to investigate the coloring problem of maps, together with his most fascinating conjectures on nowhere-zero flows. These have been extended by Jaeger et al. in 1992 to group connectivity, the nonhomogeneous form of nowhere-zero flows. Let G be a 2-edge-connected undirected graph, A be an (additive) abelian group and A∗ = A − ...
متن کاملOn the simultaneous edge-coloring conjecture
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous edge-coloring and conjectured that every bipartite graphic sequence, with all degrees at least 2, has a 2-simultaneous edge-colorable realization. In fact, this conjecture is a reformulation of a conjecture of Keedwell (Graph Theory, Combinatorics, Algorithms and Applications, Proceedings...
متن کاملExtending a partial nowhere-zero 4-flow
In [J Combin Theory Ser B, 26 (1979), 205–216], Jaeger showed that every graph with 2 edge-disjoint spanning trees admits a nowhere-zero 4-flow. In [J Combin Theory Ser B, 56 (1992), 165–182], Jaeger et al. extended this result by showing that, if A is an abelian group with |A| = 4, then every graph with 2 edgedisjoint spanning trees is A-connected. As graphs with 2 edge-disjoint spanning trees...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 24 شماره
صفحات -
تاریخ انتشار 2004